- oriented matroid
- ориентированный матроид
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
oriented matroid
Смотреть что такое "oriented matroid" в других словарях:
Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Mnev's universality theorem — In algebraic geometry, Mnev s universality theorem is a result which can be used to represent algebraic (or semi algebraic) varieties as realizations of oriented matroids, a notion of combinatorics. Contents 1 Oriented matroids 2 Stable… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Separoid — In mathematics, a separoid is a relation defined in pairs of disjoint sets which is stable as an ideal in the canonical order induced by the contention. Many mathematical objects which appear to be quite different, find a common generalisation in … Wikipedia
Shannon switching game — The Shannon switching game is an abstract strategy game for two players, invented by the father of information theory , Claude Shannon, and (at least in its common rectangular grid form) independently invented by David Gale; it has also been… … Wikipedia
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… … Wikipedia
Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
